Odd Graceful Labeling of Some New Type of Graphs
نویسندگان
چکیده
In this paper some new type of odd graceful graphs are investigated. We prove that the graph obtained by joining a cycle C8 with some star graphs S1,r keeping one vertex and three vertices gap between pair of vertices of the cycle admits odd graceful labelling. We also prove that the graph obtained by joining a cycle C12 with some star graphs S1,r keeping two, three and five vertices gap between pair of vertices of the cycle admits odd graceful labelling. We observed that C8 ʘ S 4 1,r with one vertex gap, C8 ʘ S 2 1,r three vertices gap between pair of vertices of the cycle C8 are odd graceful , C12 ʘ S 6 1,r with one vertex gap, C12 ʘ S 4 1,r two vertices gap, C12 ʘ S 3 1,r with three vertices gap and C12 ʘ S 2 1,r with five vertices gap between pair of vertices are odd graceful graphs.
منابع مشابه
Snakes and Caterpillars in Graceful Graphs
Graceful labelings use a prominent place among difference vertex labelings. In this work we present new families of graceful graphs all of them obtained applying a general substitution result. This substitution is applied here to replace some paths with some trees with a more complex structures. Two caterpillars with the same size are said to be textit{analogous} if thelarger stable sets, in bo...
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملSkolem Odd Difference Mean Graphs
In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} de...
متن کاملNew Families of Odd Graceful Graphs
In this work some new odd graceful graphs are investigated. We prove that the graph obtained by fusing all the n vertices of Cn of even order with the apex vertices of n copies of K1,m admits odd graceful labeling. In addition to this we show that the shadow graphs of path Pn and star K1,n are odd graceful graphs.
متن کاملImproper Graceful and Odd-graceful Labellings of Graph Theory
Abstract In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply the new labellings to construct large scale of graphs having improper graceful/odd-graceful labellings or having graceful/odd-graceful labellings.
متن کامل